Counting Matrices Over a Finite Field With All Eigenvalues in the Field
نویسندگان
چکیده
Given a finite field F and a positive integer n, we give a procedure to count the n×n matrices with entries in F with all eigenvalues in the field. We give an exact value for any field for values of n up to 4, and prove that for fixed n, as the size of the field increases, the proportion of matrices with all eigenvalues in the field approaches 1/n!. As a corollary, we show that for large fields, almost all matrices with all eigenvalues in the field have all eigenvalues distinct. The proofs of these results rely on the fact that any matrix with all eigenvalues in F is similar to a matrix in Jordan canonical form, and so we proceed by enumerating the number of n×n Jordan forms, and counting how many matrices are similar to each one. A key step in the calculation is to characterize the matrices that commute with a given Jordan form and count how many of them are invertible.
منابع مشابه
QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملAdjacency preservers, symmetric matrices, and cores
It is shown that the graph Γn that has the set of all n× n symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if n≥ 3. Eigenvalues of the graph Γn are calculated as well.
متن کاملGenerating matrices of highest order over a finite field
Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such matrices over GF(2) has been presented. A technique for counting all such n× n matrices over GF(2) is also presented. The technique may be easily extended to o...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کامل